Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints

The tree and path constraints, for digraph partitioning by vertexdisjoint trees and paths respectively, are unified within a single global constraint, including a uniform treatment of a variety of useful side constraints, namely precedence, incomparability, and degree constraints. The key point of the filtering is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints, in order to avoid thrashing during search. Finally, our approach is evaluated on three applications: the Hamiltonian path problem, the ordered disjoint path problem, and the phylogenetic supertree problem.